Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
نویسندگان
چکیده
منابع مشابه
Oriented Hamiltonian Cycles in Tournaments
Let T be a tournament and let D be a digraph. We say that T contains D if D is a subgraph of T. The order of a digraph D, denoted by |D|, is its number of vertices. Let x and y be two vertices of T. We write x y if (x, y) is an arc of T. Likewise, let X and Y be two subdigraphs of T. We write X Y if x y for all pairs (x, y) # V(X )_V(Y ). Let A1 , A2 , ..., Ak be a family of subdigraphs of T. W...
متن کاملHamiltonian Cycles in Regular Tournaments
We show that every regular tournament on n vertices has at least n!/(2+o(1)) Hamiltonian cycles, thus answering a question of Thomassen [17] and providing a partial answer to a question of Friedgut and Kahn [7]. This compares to an upper bound of about O(nn!/2) for arbitrary tournaments due to Friedgut and Kahn (somewhat improving Alon’s bound of O(nn!/2)). A key ingredient of the proof is a ma...
متن کاملMultipartite tournaments with small number of cycles
L. Volkmann, Discrete Math. 245 (2002) 19-53 posed the following question. Let 4 ≤ m ≤ n. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n − m + 1 cycles of length m? We answer this question in affirmative. We raise the following problem. Given m ∈ {3, 4, . . . , n}, find a characterization of strong n-partite tournaments having exactly n −m + 1 cycle...
متن کاملHamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
In [6], Thomassen conjectured that if I is a set of k − 1 arcs in a k-strong tournament T , then T − I has a Hamiltonian cycle. This conjecture was proved by Fraisse and Thomassen [3]. We prove the following stronger result. Let T = (V, A) be a k-strong tournament on n vertices and let X1, X2, . . . , Xl be a partition of the vertex set V of T such that |X1| ≤ |X2| ≤ . . . ≤ |Xl|. If k ≥ ∑l−1 i...
متن کاملA set of tournaments with many Hamiltonian cycles
For a random tournament on 3n vertices, the expected number of Hamiltonian cycles is known to be (3n− 1)!/23 . Let T1 denote a tournament of three vertices v1,v2,v3. Let the orientation be such that there are directed edges from v1to v2 , from v2 to v3 and from v3 to v1. Construct a tournament Ti by making three copies of Ti−1, T ′ i−1, T ′′ i−1 and T ′′′ i−1. Let each vertex in T ′ i−1 have di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.03.003